The Cayley-Hamilton theorem
ثبت نشده
چکیده
Theorem 1. Let A be a n × n matrix, and let p(λ) = det(λI − A) be the characteristic polynomial of A. Then p(A) = 0.
منابع مشابه
A structured approach to design-for-frequency problems using the Cayley-Hamilton theorem
An inverse eigenvalue problem approach to system design is considered. The Cayley-Hamilton theorem is developed for the general case involving the generalized eigenvalue vibration problem. Since many solutions exist for a desired frequency spectrum, a discussion of the required design information and suggestions for including structural constraints are given. An algorithm for solving the invers...
متن کامل0 D ec 1 99 9 Q - multilinear Algebra
The Cayley-Hamilton-Newton theorem which underlies the Newton identities and the Cayley-Hamilton identity is reviewed, first, for the classical matrices with commuting entries, second, for two q-matrix algebras, the RTTalgebra and the RLRL-algebra. The Cayley-Hamilton-Newton identities for these q-algebras are related by the factorization map. A class of algebras M(R̂, F̂ ) is presented. The alge...
متن کاملThe Cayley-Hamilton Theorem
This document contains a proof of the Cayley-Hamilton theorem based on the development of matrices in HOL/Multivariate Analysis.
متن کاملOn the square root of quadratic matrices
Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.
متن کاملar X iv : m at h - ph / 0 20 80 10 v 2 7 A ug 2 00 2 ALGEBRAIC INVARIANTS , DETERMINANTS , AND CAYLEY – HAMILTON THEOREM FOR HYPERMATRICES . THE FOURTH – RANK CASE
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley–Hamilton theorem for hypermatrices.
متن کاملAn Extension of the Cayley–hamilton Theorem for Nonlinear Time–varying Systems
The classical Cayley-Hamilton theorem (Gantmacher, 1974; Kaczorek, 1988; Lancaster, 1969) says that every square matrix satisfies its own characteristic equation. Let A ∈ Cn×n (the set of n × n complex matrices) and p(s) = det[Ins − A] = ∑n i=0 a si, (an = 1) be the characteristic polynomial of A. Then p(A) = ∑n i=0 aiA i = 0n (the n × n zero matrix). The Cayley Hamilton theorem was extended to...
متن کامل